import java.util.ArrayList;
import java.util.Scanner;

public class QuickSort {
    public static void main(String[] args) {
        ArrayList<Integer> array = new ArrayList<Integer>();
        Scanner in = new Scanner(System.in);
        String l = in.nextLine();
        Scanner sc = new Scanner(l);
        while(sc.hasNext()) {
            array.add(sc.nextInt());
        }
        Integer[] arr = new Integer[array.size()];
        arr = array.toArray(arr);
        sort(arr, 0, arr.length-1);
        for (Integer integer : arr) {
            System.out.print(integer + " ");
        }
    }

    public static void sort(Integer[] array, int left, int right) {
        int i, j, temp;
        i = left;
        j = right;

        if (left > right){
            return;
        }

        temp = array[i];
        while (i < j) {
            while (i < j && array[j] >= temp) {
                j--;
            }

            if (i < j) {
                array[i] = array[j];
                i++;
            }

            while (i < j && array[i] <= temp) {
                i++;
            }

            if (i < j) {
                array[j] = array[i];
                j--;
            }
        }

        array[i] = temp;
        sort(array, left, i-1);
        sort(array, i+1, right);

    }
}
